Modeling NRPs with Soft and Reified Constraints
نویسندگان
چکیده
منابع مشابه
Combining VNDS with Soft Global Constraints Filtering for Solving NRPs
Nurse Rostering Problems (NRPs) consist of generating rosters where required shifts are assigned to nurses over a scheduling period satisfying a number of constraints. In [25], we have shown how soft global constraints can be used to model NRPs in a concise and elegant way. In this paper we go one step further by proposing new neighborhood heuristics for VNS/LDS+CP. Experiments show that, despi...
متن کاملClustering with Soft and Group Constraints
Several clustering algorithms equipped with pairwise hard constraints between data points are known to improve the accuracy of clustering solutions. We develop a new clustering algorithm that extends mixture clustering in the presence of (i) soft constraints, and (ii) grouplevel constraints. Soft constraints can reflect the uncertainty associated with a priori knowledge about pairs of points th...
متن کاملHard Constraints Mirror Soft Constraints!
Person-based split-ergativity is one of a number of linguistic phenomena which reflect the general tendency, first noted in Silverstein 1976, for the hierarchy of grammatical functions to be “aligned” with hierarchies of other linguistic substance, such as person. A diachronic, usage based explanation is offered both for the existence of personbased split-ergative systems and for the absence of...
متن کاملModeling molecules with constraints
When attempting to compute thermodynamic quantities with a molecular simulation, we are frequently confronted with the problem of sampling in a high-dimensional configuration space. The dimensionality of this space is given by the number of degrees of freedom for the molecular system. Techniques which lower the number of degrees of freedom will increase the efficiency of the thermodynamic sampl...
متن کاملEffective Modeling with Constraints
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP) and a generic solver finds a solution without additional programming. However, in practice, the situation is more complicated because there usually exist several ways how to model the problem as a CSP, that is using ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AASRI Procedia
سال: 2013
ISSN: 2212-6716
DOI: 10.1016/j.aasri.2013.10.031